Capsules and Closures
نویسندگان
چکیده
منابع مشابه
Capsules and Closures
Capsules are a clean representation of the state of a computation in higher-order programming languages with effects. Their intent is to simplify and replace the notion of closure. They naturally provide support for functional and imperative features, including recursion and mutable bindings, and ensure lexical scoping without the use of closures, heaps, stacks or combinators. We present a comp...
متن کاملCapsules and Closures: A Small-Step Approach
We present a side by side comparison of Capsules and Closures, including a proof of bisimilarity, using small-step semantics. A similar proof was presented in [8], using big-step semantics. However, while big-step semantics only allow to talk about final results of terminating computations, the use of small-step semantics allows to prove a stronger bisimilarity involving every step of the compu...
متن کاملDiscussions and Closures
The writers are congratulated for developing analytical approximations to Einstein integrals herein INT1 and INT2 . It was stated by the writers in their technical note that these algorithms can be incorporated into professional hydraulic software, and the discussers agree on this. However, it is pointed out here that the calculation of INT1 and INT2 can be easily incorporated more directly by ...
متن کاملDiscussions and Closures
The writer presents a parametric study devoted to investigate the behavior of nonprismatic members having T-sections by using three-dimensional ~3D! finite-element models ~FEMs!. Fixed-end moments and stiffness coefficients were computed from the 3DFEMs considering thrust effects. As a result of the parametric study, the writer proposed a practical modeling technique based on two-noded beam ele...
متن کاملSubgraphs, Closures and Hamiltonicity
Closure theorems in hamiltonian graph theory are of the following type: Let G be a 2connected graph and let II, u be two distinct nonadjacent vertices of G. If condition c(u, u) holds, then G is hamiltonian if and only if G + MU is hamiltonian. We discuss several results of this type in which u and v are vertices of a subgraph H of G on four vertices and c(u, u) is a condition on the neighborho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2011
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2011.09.022